package com.atguigu.algorithm;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class PingPong {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNext()){
            String A=scanner.next();
            String B=scanner.next();
            Map<Character,Integer> mapA=new HashMap<>();
            Map<Character,Integer> mapB=new HashMap<>();
            for(int i=0;i<A.length();i++){
                char ch=A.charAt(i);
                if(mapA.get(ch)==null){
                    mapA.put(ch,1);
                }else{
                    mapA.put(ch,mapA.get(ch)+1);
                }
            }
            for(int i=0;i<B.length();i++){
                char ch=B.charAt(i);
                if(mapB.get(ch)==null){
                    mapB.put(ch,1);
                }else{
                    mapB.put(ch,mapB.get(ch)+1);
                }
            }
            boolean flag=true;
            for(int i=0;i<B.length();i++){
                char ch=B.charAt(i);
                if(!mapA.containsKey(ch)){
                    flag=false;
                }
                if(mapA.get(ch)!=null && mapB.get(ch)!=null) {
                    if (mapA.get(ch) < mapB.get(ch)) {
                        flag = false;
                    }
                }
            }
            if(flag){
                System.out.println("yes");
            }else{
                System.out.println("no");
            }
        }
    }
}
